Correction: A New Soft Computing Method for K-Harmonic Means Clustering
نویسندگان
چکیده
منابع مشابه
A New Soft Computing Method for K-Harmonic Means Clustering
The K-harmonic means clustering algorithm (KHM) is a new clustering method used to group data such that the sum of the harmonic averages of the distances between each entity and all cluster centroids is minimized. Because it is less sensitive to initialization than K-means (KM), many researchers have recently been attracted to studying KHM. In this study, the proposed iSSO-KHM is based on an im...
متن کاملCorrection: A New Soft Computing Method for K-Harmonic Means Clustering
[This corrects the article DOI: 10.1371/journal.pone.0164754.].
متن کاملk*-Means: A new generalized k-means clustering algorithm
This paper presents a generalized version of the conventional k-means clustering algorithm [Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, University of California Press, Berkeley, 1967, p. 281]. Not only is this new one applicable to ellipse-shaped data clusters without dead-unit problem, but also performs correct clustering without pre-assigning the exact...
متن کاملAnt clustering algorithm with K-harmonic means clustering
Clustering is an unsupervised learning procedure and there is no a prior knowledge of data distribution. It organizes a set of objects/data into similar groups called clusters, and the objects within one cluster are highly similar and dissimilar with the objects in other clusters. The classic K-means algorithm (KM) is the most popular clustering algorithm for its easy implementation and fast wo...
متن کاملVariable neighbourhood search based heuristic for K-harmonic means clustering
Although there has been a rapid development of technology and increase of computation speeds, most of the real-world optimization problems still cannot be solved in a reasonable time. Some times it is impossible for them to be optimally solved, as there are many instances of real problems which cannot be addressed by computers at their present speed. In such cases, the heuristic approach can be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2017
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0169707